منابع مشابه
Counting Colored Random Triangulations
We revisit the problem of enumeration of vertex-tricolored planar random triangulations solved in [Nucl. Phys. B 516 [FS] (1998) 543-587] in the light of recent combinatorial developments relating classical planar graph counting problems to the enumeration of decorated trees. We give a direct combinatorial derivation of the associated counting function, involving tricolored trees. This is gener...
متن کاملRandom Walks on Colored Graphs
We initiate a study of random walks on undirected graphs with colored edges. In our model, a sequence of colors is speciied before the walk begins, and it dictates the color of edge to be followed at each step. We give tight upper and lower bounds on the expected cover time of a random walk on an undirected graph with colored edges. We show that, in general, graphs with two colors have exponent...
متن کاملElegantly colored paths and cycles in edge colored random graphs
We first consider the following problem. We are given a fixed perfect matching M of [n] and we add random edges one at a time until there is a Hamilton cycle containing M . We show that w.h.p. the hitting time for this event is the same as that for the first time there are no isolated vertices in the graph induced by the random edges. We then use this result for the following problem. We genera...
متن کاملFlag f-vectors of colored complexes
It is shown that conditions stronger in a certain sense than colorshifting cannot be placed on the class of colored complexes without changing the characterization of the flag f-vectors. In the late 1970s, Stanley [6] showed that two particular classes of simplicial complexes have equivalent characterizations of their flag f-vectors. Several years later, Björner, Frankl, and Stanley [1] showed ...
متن کاملFlag f-Vectors of Three-Colored Complexes
The flag f-vectors of three-colored complexes are characterized. This also characterizes the flag h-vectors of balanced Cohen-Macaulay complexes of dimension two, as well as the flag h-vectors of balanced shellable complexes of dimension two.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2019
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.20845